A Discrete Temporal Constraint Satisfaction Problems
نویسندگان
چکیده
5 Definability of Successor and Order 10 5.1 Degrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.2 Compactness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.3 Finite-range Endomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.4 Petrus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 5.5 Boundedness and Rank . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 5.5.1 The Rank One Case . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 5.5.2 Arbitrary Rank . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 5.6 Defining succ and < . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
منابع مشابه
Processing Temporal Constraint Networks
This paper describes new algorithms for processing quantitative and qualitative Temporal Constraint Satisfaction Problems (TCSP). In contrast to discrete Constraint Satisfaction Problems (CSP), enforcing path-consistency on quantitative TCSP is exponential, due to the fragmentation problem. Identifying the fragmentation problem allows us to design several e cient polynomial algorithms that are ...
متن کاملCoping With Disjunctions in Temporal Constraint Satisfaction Problems
Path-consistency algorithms, which are polynomial for discrete problems, are exponential when applied to problems involving quantitative temporal information. The source of complexity stems from specifying relationships between pairs of time points as disjunction of intervals. We propose a polynomial algorithm, called ULT, that approximates path-consistency in Temporal Constraint Satisfaction P...
متن کاملApplying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] for solving large propositional satisfiability (SAT) problems and binary Constraint Satisfaction Problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Method (DLM) [10], have significantly ...
متن کاملit in Temporal Constraint
Path-consistency algorithms, which are polynomial for discrete problems, are exponential when applied to problems involving quantitative temporal information. The source of complexity stems from specifying relationships between pairs of time points as disjunction of intervals. We propose a polynomial algorithm, called ULT, that approximates path-consistency in Temporal Constraint Satisfaction P...
متن کاملA Local Search Approach to Modelling and Solving Interval Algebra Problems
Local search techniques have attracted considerable interest in the artificial intelligence community since the development of GSAT and the minconflicts heuristic for solving propositional satisfiability (SAT) problems and binary constraint satisfaction problems (CSPs) respectively. Newer techniques, such as the discrete Langrangian method (DLM), have significantly ∗The authors gratefully ackno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017